A Two-Phase Algorithm for Tramp Ship Routing Problems by a Column Generation Approach
نویسندگان
چکیده
A column generation approach for tramper ship routing problems is studied. We show that an efficient algorithm can be obtained by decomposing the problem into two simple problems. The master problem of the column generation is a set partitioning problem and the subproblem is the time-dependent shortest path problems with time windows. Numerical results of problems using general-purpose integerprogramming solver and the dynamic programming algorithm are included to demonstrate the performance of the proposed method.
منابع مشابه
Routing and Scheduling in Tramp Shipping - Integrating Bunker Optimization Technical report
A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize profit by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a fixed route network and itinerary as liner ships. Marine fuel is referred to as bunker and bunker costs constitute a significant part of the daily operating costs...
متن کاملRouting and Scheduling in Tramp Shipping - Integrating Bunker Optimization
A tramp ship operator typically has some contracted cargoes that must be carried and seeks to maximize profit by carrying optional cargoes. Hence, tramp ships operate much like taxies following available cargoes and not according to a fixed route network and itinerary as liner ships. Marine fuel is referred to as bunker and bunker costs constitute a significant part of the daily operating costs...
متن کاملA Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملTramp Ship Routing and Scheduling with Voyage Separation Requirements
In this paper we explore tramp ship routing and scheduling. Tramp ships operate much like taxies following the available demand as opposed to liner ships that operate more like busses on a fixed route network according to a published timetable. Tramp operators can determine some of their demand in advance by entering into long term contracts and then try to maximise profits from optional voyage...
متن کاملSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008